Reachability of Communicating Timed Processes

We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalence with Petri nets. Our results follow from mutual topology-preserving reductions between timed automata and (untimed) counter automata.Comment: Extended versio

Asynchronous timed session types: from duality to time-sensitive processes

We present a behavioural typing system for a higher-order timed calculus, using session types to model timed protocols, and the calculus to abstract implementations. Behavioural typing ensures that processes in the calculus will perform actions in the time-windows prescribed by their protocols. We introduce duality and subtyping for timed asynchronous session types. Duality includes a class of protocols that previous work on asynchronous timed session types could not type-check. Subtyping is critical for precision of our typing system, especially for session delegation. The composition of dual (timed asynchronous) types enjoys progress when using an urgent receive semantics, in which receive actions are executed as soon as the expected message is available. Our calculus increases the modelling power of calculi used in the previous work on timed sessions, adding a blocking receive primitive with timeout, and a primitive that consumes an arbitrary amount of time in a given range

Inclusive and multiplicity dependent production of electrons from heavy-flavour hadron decays in pp and p-Pb collisions

Measurements of the production of electrons from heavy-flavour hadron decays in pp collisions at root s = 13 TeV at midrapidity with the ALICE detector are presented down to a transverse momentum (p(T)) of 0.2 GeV/c and up to p(T) = 35 GeV/c, which is the largest momentum range probed for inclusive electron measurements in ALICE. In p-Pb collisions, the production cross section and the nuclear modification factor of electrons from heavy-flavour hadron decays are measured in the p(T) range 0.5 < p(T) < 26 GeV/c at root s(NN) = 8.16 TeV. The nuclear modification factor is found to be consistent with unity within the statistical and systematic uncertainties. In both collision systems, first measurements of the yields of electrons from heavy-flavour hadron decays in different multiplicity intervals normalised to the multiplicity-integrated yield (self-normalised yield) at midrapidity are reported as a function of the self-normalised charged-particle multiplicity estimated at midrapidity. The self-normalised yields in pp and p-Pb collisions grow faster than linear with the self-normalised multiplicity. A strong p(T) dependence is observed in pp collisions, where the yield of high-p(T) electrons increases faster as a function of multiplicity than the one of low-p(T) electrons. The measurement in p-Pb collisions shows no p(T) dependence within uncertainties. The self-normalised yields in pp and p-Pb collisions are compared with measurements of other heavy-flavour, light-flavour, and strange particles, and with Monte Carlo simulations

Accessing the strong interaction between Λ baryons and charged kaons with the femtoscopy technique at the LHC

The interaction between Λ baryons and kaons/antikaons is a crucial ingredient for the strangeness S=0 and S=-2 sector of the meson–baryon interaction at low energies. In particular, the Lambda-Kbar might help in understanding the origin of states such as the Csi(1620), whose nature and properties are still under debate. Experimental data on Lambda-K and Lambda-Kbar systems are scarce, leading to large uncertainties and tension between the available theoretical predictions constrained by such data. In this Letter we present the measurements of Λ–KK− and Λ–KK+ correlations obtained in the high-multiplicity triggered data sample in pp collisions at sqrt(s) = 13 TeV recorded by ALICE at the LHC. The correlation function for both pairs is modeled using the Lednický–Lyuboshits analytical formula and the corresponding scattering parameters are extracted. The Λ–KK+ correlations show the presence of several structures at relative momenta k* above 200 MeV/c, compatible with the Ω baryon, the , and resonances decaying into Λ–K− pairs. The low k* region in the Λ–KK+ also exhibits the presence of the state, expected to strongly couple to the measured pair. The presented data allow to access the ΛK+ and ΛK− strong interaction with an unprecedented precision and deliver the first experimental observation of the decaying into ΛK−

Measurement of the non-prompt D-meson fraction as a function of multiplicity in proton-proton collisions at s \sqrt{s} = 13 TeV

The fractions of non-prompt (i.e. originating from beauty-hadron decays) D0 and D+ mesons with respect to the inclusive yield are measured as a function of the charged-particle multiplicity in proton-proton collisions at a centre-of-mass energy of √s = 13 TeV with the ALICE detector at the LHC. The results are reported in intervals of transverse momentum (pT) and integrated in the range 1 < pT < 24 GeV/c. The fraction of non-prompt D0 and D+ mesons is found to increase slightly as a function of pT in all the measured multiplicity intervals, while no significant dependence on the charged- particle multiplicity is observed. In order to investigate the production and hadronisation mechanisms of charm and beauty quarks, the results are compared to PYTHIA 8 as well as EPOS 3 and EPOS 4 Monte Carlo simulations, and to calculations based on the colour glass condensate including three-pomeron fusion

Automata and Logics for Timed Message Sequence Charts

We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence charts (T-MSCs). As a specification language, we propose a monadic secondorder logic equipped with timing predicates and interpreted over T-MSCs. We establish expressive equivalence of our automata and logic. Moreover, we prove that, for (existentially) bounded channels, emptiness and satisfiability are decidable for our automata and logic